Pii: S0360-8352(02)00181-x
نویسندگان
چکیده
We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold accepting. We demonstrate that our application of these meta-heuristics is efficient in obtaining near-optimal solutions by solving 140 benchmark problems with up to 1000 jobs. Furthermore, we compare their solution quality and find that a new variant of threshold accepting is superior to the other approaches. q 2002 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Pii: S0360-8352(02)00136-5
The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The conseq...
متن کاملPii: S0360-8352(02)00179-1
This paper introduces a new heuristic based on Kohonen’s self-organizing feature map for the traveling salesman problem with backhauls (TSPB). The TSPB is an extension of the traveling salesman problem in which a set of customers is partitioned into a set of linehaul customers to be visited contiguously at the beginning of the route and a set of backhaul customers to be visited once all linehau...
متن کاملA flexible decision support system for steel hot rolling mill scheduling
A steel hot rolling mill subjects steel slabs to high temperatures and pressures in order to form steel coils. We describe the scheduling problem for a steel hot rolling mill. We detail the operation of a commercial decision support system which provides semi-automatic schedules, comparing its operation with existing, manual planning procedures. This commercial system is currently in use in sev...
متن کاملPii: S0360-8352(98)00105-3
ÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that approximate the optimal solution. The branch-and-bound procedure uses the heuristics to establish an ini...
متن کاملPii: S0360-8352(99)00086-8
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality. Computational r...
متن کامل